Distributed Computing Column 39: Byzantine Generals: The Next Generation

نویسنده

  • Idit Keidar
چکیده

The relevance of Byzantine fault tolerance in the context of cloud computing has been questioned[3]. While arguments against Byzantine fault tolerance seemingly makes sense in the context of a singlecloud, i.e., a large-scale cloud infrastructure that resides under control of a single, typically commercialprovider, these arguments are less obvious in a broader context of the Intercloud, i.e., a cloud of multiple,independent clouds.In this paper, we start from commonly acknowledged issues that impede the adoption of Byzantinefault tolerance within a single cloud, and argue that many of these issues fade when Byzantine faulttolerance in the Intercloud is considered.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lecture 20: Distributed Computing and Streaming Algorithms 1.1 Byzantine Generals Problem 1.2 Rabin's Randomized Algorithm

Distributed computing deals with situations where there is no unique computing center, but there are many centers where computation happens, and these centers should compute something together. For instance, on aircraft there are many sensors of different kind that should agree on what is happening around, or there is distributed network that wants for instance to agree on time. We consider the...

متن کامل

Byzantine Generals and Transaction Commit Protocols

The transaction commit problem in a distributed database system is an instance of the Weak Byzantine Generals problem. It is shown that even under the assumption that a process can fail only by “crashing”—failing to send any more messages—a solution to this problem that can tolerate k failures must, in the worst case, require at least k + 1 message-passing delays. Under this same assumption, a ...

متن کامل

Byzantine Fault Tolerance, from Theory to Reality

Since its introduction nearly 20 years ago, the Byzantine Generals Problem has been the subject of many papers having the scrutiny of the fault tolerance community. Numerous Byzantine tolerant algorithms and architectures have been proposed. However, this problem is not yet sufficiently understood by those who design, build, and maintain systems with high dependability requirements. Today, ther...

متن کامل

On Byzantine generals with alternative plans

This paper proposes a variation of the Byzantine generals problem (or Byzantine consensus). Each general has a set of good plans and a set of bad plans. The problem is to make all loyal generals agree on a good plan proposed by a loyal general, and never on a bad plan.

متن کامل

Distributed Consensus Revisited

Distributed Consensus is a classical problem in distributed computing. It requires the correct processors in a distributed system to agree on a common value despite the failure of other processors. This problem is closely related to other problems, such as Byzantine Generals, Approximate Agreement , and k-Set Agreement. This paper examines a variant of Distributed Consensus that considers agree...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIGACT News

دوره 41  شماره 

صفحات  -

تاریخ انتشار 2010